CORE

🇺🇦   make metadata, not war

    48 research outputs found

    Discovery of Maximally Frequent Tag Tree Patterns in Semistructured Data (New Developments of Theory of Computation and Algorithms)

    Author
    Publication venue
    京都大学数理解析研究所
    Publication date
    Field of study
    Get PDF
    Kyoto University Research Information Repository

    タコウシキジカンPACガクシュウカノウナキハバテイスウグラフタイケイニツイテ

    Author
    Publication venue
    九州国際大学教養学会 ; 1994-
    Publication date
    Field of study
    Get PDF
    Kyushu International University Repository / 九州国際大学学術成果リポジトリ

    Refutable Inference of Formal Graph Systems and NLC Graph Grammars (Models of Computation and Algorithms)

    Author
    Publication venue
    京都大学数理解析研究所
    Publication date
    Field of study
    Get PDF
    Kyoto University Research Information Repository

    Topological Sorting の NLOG 完全性について(計算アルゴリズムと計算量の基礎理論)

    Author
    Publication venue
    京都大学数理解析研究所
    Publication date
    Field of study
    Get PDF
    Kyoto University Research Information Repository

    A P-Complete Language Describable with Iterated Shuffle

    Author
    Publication venue
    京都大学数理解析研究所
    Publication date
    Field of study
    Get PDF
    Kyoto University Research Information Repository

    Using Maximal Independent Sets to Solve Problems in Parallel

    Author
    Publication venue
    京都大学数理解析研究所
    Publication date
    Field of study
    Get PDF
    Kyoto University Research Information Repository

    Polynomial Time Matching Algorithms for Tree Structured Patterns (Foundations of Computer Science)

    Author
    Publication venue
    京都大学数理解析研究所
    Publication date
    Field of study
    Get PDF
    Kyoto University Research Information Repository

    On the Complexity of Data Mining for Binary Decision Diagram Rules

    Author
    Publication venue
    京都大学数理解析研究所
    Publication date
    Field of study
    Get PDF
    Kyoto University Research Information Repository

    A Polynomial Time Pattern Matching Algorithm on Graph Patterns of Bounded Treewidth

    Author
    Publication venue
    'Institute of Electronics, Information and Communications Engineers (IEICE)'
    Publication date
    Field of study
    No full text
    Crossref

    Polynomial Time Inductive Inference of Ordered Term Trees with Contractible Variables from Positive Data (New Aspects of Theoretical Computer Science)

    Author
    Publication venue
    京都大学数理解析研究所
    Publication date
    Field of study
    Get PDF
    Kyoto University Research Information Repository
    corecore